Permanents, max algebra and optimal assignment

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Max algebra and the linear assignment problem

Max-algebra, where the classical arithmetic operations of addition and multiplication are replaced by a ⊕ b := max(a, b) and a ⊗ b := a + b offers an attractive way for modelling discrete event systems and optimization problems in production and transportation. Moreover, it shows a strong similarity to classical linear algebra: for instance, it allows a consideration of linear equation systems ...

متن کامل

Max-Plus algebra on tensors and its properties

In this paper we generalize the max plus algebra system of real matrices to the class of real tensors and derive its fundamental properties. Also we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverses of tensors is characterized.

متن کامل

Max-plus algebra

The max-plus semiring Rmax is the set R∪{−∞}, equipped with the addition (a, b) 7→ max(a, b) and the multiplication (a, b) 7→ a + b. The identity element for the addition, zero, is −∞, and the identity element for the multiplication, unit, is 0. To illuminate the linear algebraic nature of the results, the generic notations +, , × (or concatenation), 0 and 1 are used for the addition, the sum, ...

متن کامل

Max-algebra: the linear algebra of combinatorics?

Let a ⊕ b = max(a, b), a ⊗ b = a + b for a, b ∈ R := R ∪ {−∞}. By max-algebra we understand the analogue of linear algebra developed for the pair of operations (⊕,⊗) extended to matrices and vectors. Max-algebra, which has been studied for more than 40 years, is an attractive way of describing a class of nonlinear problems appearing for instance in machinescheduling, information technology and ...

متن کامل

Timetable Synthesis Using (max,+) Algebra

This paper deals with control of transportation systems. We propose an approach based on dioid theory to compute timetables of a transportation network. We generalize the problem by considering additional constraints for the control objective. Copyright c ©2006 IFAC

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1995

ISSN: 0024-3795

DOI: 10.1016/0024-3795(95)00304-a